Semirings whose additive endomorphisms are multiplicative
نویسنده
چکیده
A ring or an idempotent semiring is associative provided that additive endomorphisms are multiplicative.
منابع مشابه
Varieties Generated by Ordered Bands I
Ordered bands are regarded as semirings whose multiplicative reduct is a band and whose additive reduct is a chain. We find the variety of semirings generated by all ordered bands and we determine part of the lattice of its subvarieties. Mathematics Subject Classification (2000): 16Y60, 08B05, 20M07.
متن کاملCircuit Evaluation for Finite Semirings
The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring is such that (i) the multiplicative semigroup is solvable and (ii) it does not contain a subsemiring with an additive identity 0 and a multiplicative identity 1 6=...
متن کاملKleene Algebra
3 Dioids 4 3.1 Join Semilattices . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.2 Join Semilattices with an Additive Unit . . . . . . . . . . . . 5 3.3 Near Semirings . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.4 Variants of Dioids . . . . . . . . . . . . . . . . . . . . . . . . 6 3.5 Families of Nearsemirings with a Multiplicative Unit . . . . . 8 3.6 Families of Nearsemirin...
متن کاملA Note on Compact Semirings
By a topological semiring we mean a Hausdorff space S together with two continuous associative operations on S such that one (called multiplication) distributes across the other (called addition). That is, we insist that x(y-{-z)=xy-\-xz and (x-\-y)z = xz-\-yz for all x, y, and z in 5. Note that, in contrast to the purely algebraic situation, we do not postulate the existence of an additive ide...
متن کاملA relation between additive and multiplicative complexity of Boolean functions
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {⊕,∧, 1}. To start, consider a problem of computation of polynomials over a semiring (K,+,×) by circuits over the arithmetic basis {+,×} ∪K. It’s a common knowledge that a polynomial of n variables with nonsca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010